Combinatorial Laplacian of the Matching Complex
نویسندگان
چکیده
A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We show how the combinatorial Laplacian can be used to give an elegant proof of this result. We also show that the spectrum of the Laplacian is integral.
منابع مشابه
Fault Detection and Isolation of Multi-Agent Systems via Complex Laplacian
This paper studies the problem of fault detection and isolation (FDI) for multi-agent systems (MAS) via complex Laplacian subject to actuator faults. A planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacian is achieved. The communication network is a directed, and yet connected graph with a fixed topology. The loss of symmetry in the...
متن کاملSome New Results on the Combinatorial Laplacian A THESIS PRESENTED IN PARTIAL FULFILLMENT OF CRITERIA FOR HONORS IN MATHEMATICS
In this thesis we discuss some new results concerning the combinatorial Laplace operator of a simplicial complex. The combinatorial Laplacian of a simplicial complex encodes information about the relationships between adjacent simplices in the complex. This thesis is divided into two relatively disjoint parts. In the first portion of the thesis, we derive a relationship between the Laplacian sp...
متن کاملCombinatorial Laplacian and entropy of simplicial complexes associated with complex networks
Abstract. Simplicial complexes represent useful and accurate models of complex networks and complex systems in general. We explore the properties of spectra of combinatorial Laplacian operator of simplicial complexes and show its relationship with connectivity properties of the Q-vector and with connectivities of cliques in the simplicial clique complex. We demonstrate the need for higher order...
متن کاملSpeech Enhancement using Laplacian Mixture Model under Signal Presence Uncertainty
In this paper an estimator for speech enhancement based on Laplacian Mixture Model has been proposed. The proposed method, estimates the complex DFT coefficients of clean speech from noisy speech using the MMSE estimator, when the clean speech DFT coefficients are supposed mixture of Laplacians and the DFT coefficients of noise are assumed zero-mean Gaussian distribution. Furthermore, the MMS...
متن کاملA ug 2 00 0 APPROXIMATING L 2 TORSION ON AMENABLE COVERING SPACES
In this paper, we prove that the L combinatorial torsion of an amenable covering space can be approximated by the combinatorial torsions of a regular exhaustion. An ancillary theorem shows the L spectral density function of the combinatorial Laplacian on L-cochains on the covering space is approximated by the average spectral density functions of the combinatorial Laplacian on the cochains of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 9 شماره
صفحات -
تاریخ انتشار 2002